PHA*: Finding the Shortest Path with A* in An Unknown Physical Environment
نویسندگان
چکیده
منابع مشابه
PHA*: Finding the Shortest Path with A* in An Unknown Physical Environment
We address the problem of nding the shortest path between two points in an unknown real physical environment where a traveling agent must move around in the environment to explore unknown territory We introduce the Physical A algorithm PHA for solving this problem PHA expands all the mandatory nodes that A would expand and returns the shortest path between the two points However due to the phys...
متن کاملTwo optimal algorithms for finding bi-directional shortest path design problem in a block layout
In this paper, Shortest Path Design Problem (SPDP) in which the path is incident to all cells is considered. The bi-directional path is one of the known types of configuration of networks for Automated Guided Vehi-cles (AGV).To solve this problem, two algorithms are developed. For each algorithm an Integer Linear Pro-gramming (ILP) is determined. The objective functions of both algorithms are t...
متن کاملA Grid-based Approach for Finding Conditional Shortest Paths in an Unknown Environment
The problem of nding a shortest path through a known environment has been well studied. A more realistic and challenging problem is navigation through an unknown environment, where path planning is implemented \on the y" as new obstacle information becomes available through external sensors. A conditional shortest path is a path of shortest Euclidean distance that is computed based on the avail...
متن کاملFinding the shortest path with PesCa: a tool for network
Network analysis is of growing interest in several fields ranging from economics to biology. Several methods have been developed to investigate different properties of physical networks abstracted as graphs, including quantification of specific topological properties, contextual data enrichment, simulation of pathway dynamics and visual representation. In this context, the PesCa app for the Cyt...
متن کاملFATES: Finding A Time dEpendent Shortest path
We model a moving object as a sizable physical entity equipped with GPS, wireless communication capability, and a computer. Based on a grid model, we develop a distributed system, FATES, to manage data for moving objects in a two-dimensional space. The system is used to provide time-dependent shortest paths for moving objects. The performance study shows that FATES yields shorter average trip t...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Artificial Intelligence Research
سال: 2004
ISSN: 1076-9757
DOI: 10.1613/jair.1373